Graph spectral techniques in computer sciences
نویسندگان
چکیده
منابع مشابه
Spectral Techniques in Graph Algorithms
The existence of efficient algorithms to compute the eigenvectors and eigenvalues of graphs supplies a useful tool for the design of various graph algorithms. In this survey we describe several algorithms based on spectral techniques focusing on their performance for randomly generated input graphs.
متن کاملGraph-spectral methods for computer vision
This thesis describes a family of graph-spectral methods for computer vision that exploit the properties of the first eigenvector of the adjacency matrix of a weighted graph. The algorithms are applied to segmentation and grouping, shape-from-shading and graphmatching. In Chapter 3, we cast the problem of grouping into an evidence combining setting where the number of clusters is determined by ...
متن کاملGraph Products, Fourier Analysis and Spectral Techniques
We consider powers of regular graphs defined by the weak graph product and give a characterization of maximum-size independent sets for a wide family of base graphs which includes, among others, complete graphs, line graphs of regular graphs which contain a perfect matching and Kneser graphs. In many cases this also characterizes the optimal colorings of these products. We show that the indepen...
متن کاملGraph Partitioning via Adaptive Spectral Techniques
In this paper we study the use of spectral techniques for graph partitioning. Let G = (V,E) be a graph whose vertex set has a “latent” partition V1, . . . , Vk. Moreover, consider a “density matrix” E = (Evw)v,w∈V such that for v ∈ Vi and w ∈ Vj the entry Evw is the fraction of all possible ViVj -edges that are actually present in G. We show that on input (G, k) the partition V1, . . . , Vk can...
متن کاملGraph Matching Techniques for Computer Vision
Many computer vision applications require a comparison between two objects, or between an object and a reference model. When the objects or the scenes are represented by graphs, this comparison can be performed using some form of graph matching. The aim of this chapter is to introduce the main graph matching techniques that have been used for computer vision, and to relate each application with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applicable Analysis and Discrete Mathematics
سال: 2012
ISSN: 1452-8630,2406-100X
DOI: 10.2298/aadm111223025a